Multiobjective , preference - based search in acyclic OR - graphs *
نویسندگان
چکیده
We consider the problem of determining a most preferred path from a start node to a goal node set in an acyclic OR-graph, given a multiattribute preference function, a multiobjective reward structure, and heuristic information about this reward structure. We present an algorithm which is shown to terminate with a most preferred path, given an admissible heuristic set. The algorithm illustrates how Artificial Intelligence techniques can be productively employed to solve multiobjective problems.
منابع مشابه
Bidirectional Preference-based Search for Multiobjective State Space Graph Problems
In multiobjective state space graph problems, each solution-path is evaluated by a cost vector. These cost vectors can be partially or completely ordered using a preference relation compatible with Pareto dominance. In this context, multiobjective preference-based search (MOPBS) aims at computing the preferred feasible solutions according to a predefined preference model, these preferred soluti...
متن کاملCombining Preference Elicitation and Search in Multiobjective State-Space Graphs
The aim of this paper is to propose a new approach interweaving preference elicitation and search to solve multiobjective optimization problems. We present an interactive search procedure directed by an aggregation function, possibly non-linear (e.g. an additive disutility function, a Choquet integral), defining the overall cost of solutions. This function is parameterized by weights that are i...
متن کاملBidirectional Preference-Based Search for State Space Graph Problems
In multiobjective state space graph problems, each solution-path is evaluated by a cost vector. These cost vectors can be partially or completely ordered using a preference relation compatible with Pareto dominance. In this context, multiobjective preference-based search (MOPBS) aims at computing the preferred feasible solutions according to a predefined preference model, these preferred soluti...
متن کاملHypervolume-Based Search for Multiobjective Optimization: Theory and Methods
xi Zusammenfassung xiii Statement of Contributions xv Acknowledgments xvii List of Symbols and Abbreviations xvii Introduction . Introductory Example . . . . . . . . . . . . . . . . . . . . . . . . .. Multiobjective Problems . . . . . . . . . . . . . . . . . . . .. Selecting the Best Solutions . . . . . . . . . . . . . . . . . .. The Hypervolume Indicator . . . . . . . . . ...
متن کاملState Space Search for Risk-Averse Agents
We investigate search problems under risk in statespace graphs, with the aim of finding optimal paths for risk-averse agents. We consider problems where uncertainty is due to the existence of different scenarios of known probabilities, with different impacts on costs of solution-paths. We consider various non-linear decision criteria (EU, RDU, Yaari) to express risk averse preferences; then we ...
متن کامل